import java.util.Scanner;
import java.lang.Math;

/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: jingziyou
 * Date: 2023-03-23
 * Time: 19:25
 */
public class Test {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String str = sc.nextLine();
        char[] arr = str.toCharArray();
        int[] b = new int[123];
        int max = 0, min = 100;
        for (int i = 0; i < str.length(); i++) {
            b[arr[i]]++;
            if (b[arr[i]] > max)
                max = b[arr[i]];
        }
        for (int i = 97; i <= 122; i++) {
            if (b[i] > 0) {
                if (b[i] < min)
                    min = b[i];
            }
        }
        if (isPrime(max - min) == 1) {
            System.out.println("Lucky Word");
            System.out.println(max - min);
        } else {
            System.out.println("No Answer");
            System.out.println('0');
        }
    }

    public static int isPrime(int n) {
        if (n == 0 || n == 1)
            return 0;
        if (n == 2)
            return 1;
        for (int i = 3; i <= Math.sqrt(n); i++) {
            if (n % i == 0) {
                return 0;
            }
        }
        return 1;
    }
}
